Comparing UCT versus CFR in Simultaneous Games
نویسندگان
چکیده
Simultaneous move games where all the player have to take their actions simultaneously are a class of games in general game playing. In this paper we analyze how UCT performs in this class of games. We argue that UCT does not converge to a Nash equilibrium in general and the situation that it converges to can be exploited. We also analyze CFR (CounterFactual Regret) and show how it can be used to exploit UCT.
منابع مشابه
Self-Play Monte-Carlo Tree Search in Computer Poker
Self-play reinforcement learning has proved to be successful in many perfect information two-player games. However, research carrying over its theoretical guarantees and practical success to games of imperfect information has been lacking. In this paper, we evaluate selfplay Monte-Carlo Tree Search (MCTS) in limit Texas Hold’em and Kuhn poker. We introduce a variant of the established UCB algor...
متن کاملCoronary thermodilution to assess flow reserve: validation in humans.
BACKGROUND Guide wire-based simultaneous measurement of fractional flow reserve (FFR) and coronary flow reserve (CFR) is important to understand microvascular disease of the heart. The aim of this study was to investigate the feasibility of simultaneous measurement of FFR and CFR by one pressure-temperature sensor-tipped guide wire with the use of coronary thermodilution and to compare CFR by t...
متن کاملMonte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel
Monte Carlo Tree Search (MCTS) has become a widely popular sampled-based search algorithm for two-player games with perfect information. When actions are chosen simultaneously, players may need to mix between their strategies. In this paper, we discuss the adaptation of MCTS to simultaneous move games. We introduce a new algorithm, Online Outcome Sampling (OOS), that approaches a Nash equilibri...
متن کاملAn Analysis of UCT in Multi-player Games
The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an analysis of the UCT algorithm in multi-player games, showing that UCT, when run in a multi-player game, is computing a mixed-strategy equilibrium, as opposed to max, which computes a pure-strategy equilibrium. We anal...
متن کاملSmooth UCT Search in Computer Poker
Self-play Monte Carlo Tree Search (MCTS) has been successful in many perfect-information twoplayer games. Although these methods have been extended to imperfect-information games, so far they have not achieved the same level of practical success or theoretical convergence guarantees as competing methods. In this paper we introduce Smooth UCT, a variant of the established Upper Confidence Bounds...
متن کامل